Order-Preserving Transformations and Greedy-Like Algorithms
نویسنده
چکیده
Borodin, Nielsen and Rackoff [5] proposed a framework for abstracting the main properties of greedy-like algorithms with emphasis on scheduling problems, and Davis and Impagliazzo [6] extended it so as to make it applicable to graph optimization problems. In this paper we propose a related model which places certain reasonable restrictions on the power of the greedy-like algorithm. Our goal is to define a model in which it is possible to filter out certain overly powerful algorithms, while still capturing a very rich class of greedy-like algorithms. We argue that this approach better motivates the lower-bound proofs and possibly yields better bounds. To illustrate the techniques involved we apply the model to the well-known problems of (complete) facility location and
منابع مشابه
Feature-Preserving Mesh Simplification: A Greedy Vertex Cover
In computer graphics rendering algorithms like ray tracing, the complexity of meshes decreases the performance of these algorithms. Therefore, the need arises for reduced mesh complexity with considerably good quality and at the same time preserving the salient features of the shape. Mesh simplification problem in some cases can be considered as an initial value problem where the quality of the...
متن کاملSome Observations on Dirac Measure-Preserving Transformations and their Results
Dirac measure is an important measure in many related branches to mathematics. The current paper characterizes measure-preserving transformations between two Dirac measure spaces or a Dirac measure space and a probability measure space. Also, it studies isomorphic Dirac measure spaces, equivalence Dirac measure algebras, and conjugate of Dirac measure spaces. The equivalence classes of a Dirac ...
متن کاملOn Infinitesimal Conformal Transformations of the Tangent Bundles with the Generalized Metric
Let be an n-dimensional Riemannian manifold, and be its tangent bundle with the lift metric. Then every infinitesimal fiber-preserving conformal transformation induces an infinitesimal homothetic transformation on . Furthermore, the correspondence gives a homomorphism of the Lie algebra of infinitesimal fiber-preserving conformal transformations on onto the Lie algebra of infinitesimal ...
متن کاملPrivacy-Preserving Genetic Algorithms for Rule Discovery
Decision tree induction algorithms generally adopt a greedy approach to select attributes in order to optimize some criteria at each iteration of the tree induction process. When a decision tree has been constructed, a set of decision rules may be correspondingly derived. Univariate decision tree induction algorithms generally yield the same tree regardless of how many times it is induced from ...
متن کاملA Characterization of the Entropy--Gibbs Transformations
Let h be a finite dimensional complex Hilbert space, b(h)+ be the set of all positive semi-definite operators on h and Phi is a (not necessarily linear) unital map of B(H) + preserving the Entropy-Gibbs transformation. Then there exists either a unitary or an anti-unitary operator U on H such that Phi(A) = UAU* for any B(H) +. Thermodynamics, a branch of physics that is concerned with the study...
متن کامل